A Finite Basis Theorem for Residually Finite, Congruence Meet-Semidistributive Varieties
نویسنده
چکیده
We derive a Mal'cev condition for congruence meet-semidistributivity and then use it to prove two theorems. Theorem A: if a variety in a nite language is congruence meet-semidistributive and residually less than some nite cardinal, then it is nitely based. Theorem B: there is an algorithm which, given m < ! and a nite algebra in a nite language, determines whether the variety generated by the algebra is congruence meet-semidistributive and residually less than m.
منابع مشابه
Residually Finite, Congruence Meet-semidistributive Varieties of Finite Type Have a Finite Residual Bound
We show that a residually finite, congruence meet-semidistributive variety of finite type is residually < N for some finite N . This solves Pixley’s problem and a special case of the restricted Quackenbush problem.
متن کاملExtending Baker’s theorem
We summarize the combinatorial properties of congruence generation in congruence distributive varieties which are relevant to Baker’s finite basis theorem, explain the extent to which these properties survive in congruence meet-semidistributive varieties, indicate our approach to extending Baker’s theorem to the latter varieties, and pose several problems which our approach does not answer.
متن کاملDualisability versus Residual Character: a Theorem and a Counterexample
We show that a finite algebra must be inherently non-dualisable if the variety that it generates is both residually large and congruence meetsemidistributive. We also give the first example of a finite dualisable algebra that generates a variety that is residually large. There is no obvious connection between the dualisability of a finite algebra and the residual character of the variety it gen...
متن کاملA Finite Basis Theorem for Difference-term Varieties with a Finite Residual Bound
We prove that if V is a variety of algebras (i.e., an equationally axiomatizable class of algebraic structures) in a finite language, V has a difference term, and V has a finite residual bound, then V is finitely axiomatizable. This provides a common generalization of R. McKenzie’s finite basis theorem for congruence modular varieties with a finite residual bound, and R. Willard’s finite basis ...
متن کاملCongruence Lattices of Congruence Semidistributive Algebras
Nearly twenty years ago, two of the authors wrote a paper on congruence lattices of semilattices [9]. The problem of finding a really useful characterization of congruence lattices of finite semilattices seemed too hard for us, so we went on to other things. Thus when Steve Seif asked one of us at the October 1990 meeting of the AMS in Amherst what we had learned in the meantime, the answer was...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 65 شماره
صفحات -
تاریخ انتشار 2000